Genetic Algorithm with Elitist-Tournament for Clashes-Free Slots of Lecturer Timetabling Problem
نویسندگان
چکیده
منابع مشابه
Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملA genetic algorithm for a university weekly courses timetabling problem
The timetabling problem is concerned with the allocation, subject to constraints, of given resources to objects in space and time in such way as to satisfy as nearly as possible a set of desirable objectives. This problem is known to be NP-complete and as such only combinatorial optimization methods can guarantee an optimal timetable. In this paper we propose a sector-based genetic algorithm fo...
متن کاملAn informed genetic algorithm for the examination timetabling problem
This paper presents the results of a study conducted to investigate the use of genetic algorithms (GAs) as a means of inducing solutions to the examination timetabling problem (ETP). This study differs from previous efforts applying genetic algorithms to this domain in that firstly it takes a two-phased approach to the problem which focuses on producing timetables that meet the hard constraints...
متن کاملA Parallel Genetic Algorithm for Solving the School Timetabling Problem
Genetic algorithms (GA) have been applied to a number of optimisation problems with some success The algorithms mimic the process of natural selection, with the effect of creating a number of potentially optimal solutions to some complex search problem. One of the major disadvantages of genetic algorithms is that they are very slow. In this paper we discuss the application of a GA to the school...
متن کاملAn Elitist Genetic Algorithm for Multiobjective Optimization
Solving multiobjective engineering problems is a very difficult task due to, in general, in these class of problems, the objectives conflict across a high-dimensional problem space. In these problems, there is no single optimal solution, the interaction of multiple objectives gives rise to a set of efficient solutions, known as the Pareto-optimal solutions. During the past decade, Genetic Algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2018
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v12.i1.pp303-309